An Accelerated Imm-jpda Algorithm for Tracking Multiple Maneuvering Targets in Clutter

By far, the most complicated case in target tracking is to track multiple maneuvering targets in heavy clutter. Numerous methods and algorithms have been devoted to this problem and for any one of them pros and cons can be pointed out. Theoretically, for example, the MHT method is known to be the most powerful approach to tracking multiple maneuvering targets in clutter. This method, however, very often leads to combinatorial explosion and computational overload that restricts its implementation. Recently, numerous papers have been devoted to algorithms capable to compute a ranked set of assignments of measurements to targets. Such algorithms allowed for the first practical implementations of MHT the approach.